R + + -Tree: An Efficient Spatial Access Method for Highly Redundant Point Data
نویسندگان
چکیده
We present a new spatial index belonging to R-tree family. Since our new index comes out from the R-tree and holds the concept of nonoverlapping nodes we call it R-tree. The original R-tree was designed for both point and spatial data. Using R-tree for indexing spatial data is very inefficient. In our research we face the problem of indexing product catalogues data that can be represented as point data. Therefore we suggested the R-tree for point data only. We present a dynamic index R-tree as an improvement of R-tree. In the tests we show that R-tree offers even better search efficiency than R*-tree when highly redundant point data is considered. Moreover the construction time of R-tree is much shorter than the construction time of R*tree.
منابع مشابه
KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data
The problem of storing and retrieving highdimensional data continues to be an important issue. In this paper, we propose an efficient high-dimensional point access method called the KDBKD-tree. The KDBKD-tree eliminates redundant information in KDB-trees by changing the representation of the index entries in the interior pages. Experimental evidence shows that the KDBKD-Tree outperforms other r...
متن کاملThe Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
In this paper, we propose a new multidimensional access method, called the buddy-tree, to support point as well as spatial data in a dynamic environment. The buddy-tree can be seen as a compromise of the R-tree and the grid file, but it is fundamentally different from each of them. Because grid files loose performance for highly correlated data, the buddy-tree is designed to organize such data ...
متن کاملOptimization of Disk Accesses for Multidimensional Range Queries
Multidimensional data structures have become very popular in recent years. Their importance lies in efficient indexing of data, which have naturally multidimensional characteristics like navigation data, drawing specifications etc. The R-tree is a well-known structure based on the bounding of spatial near points by rectangles. Although efficient query processing of multidimensional data is requ...
متن کاملSpatial Access Methods for Organizing Laserscanner Data
Laserscanning produces large sets of multidimensional point data, which demand for an effective and efficient organization and storage. Adequate data structures must perform specific spatial queries and operations in order to support the computation and / or the construction of surface models. Because of their increasing size, it is not advisable to organize the clouds of points by mainmemory d...
متن کاملAn Efficient Green Approach for the Synthesis of Fluoroquinolones Using Nano Zirconia Sulfuric Acid as Highly Efficient Recyclable Catalyst in two Forms of Water
Various antibacterial fluoroquinolone compounds were prepared by the direct amination of 7-halo-6- fluoroquinolone-3-carboxylic acids with a variety of piperazine derivatives and (4aR,7aR)-octahydro-1H-pyrrolo[3,4-b] pyridine using Zirconia Sulfuric Acid (ZrSA) nanoparticle, as a catalyst in the presence of ordinary or magnetized water upon reflux condition. The results showed that ZrSA exh...
متن کامل